Algorithms for Boolean Function Query Properties
نویسندگان
چکیده
منابع مشابه
Algorithms for Boolean Function Query Properties
We present new algorithms to compute fundamental properties of a Boolean function given in truth-table form. Specifically, we give an O(N logN) algorithm for block sensitivity, an O(N logN) algorithm for ‘tree decomposition,’ and an O(N) algorithm for ‘quasisymmetry.’ These algorithms are based on new insights into the structure of Boolean functions that may be of independent interest. We also ...
متن کاملGraph-Based Algorithms for Boolean Function Manipulation12
In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions on the ordering of decision variables in the graph. Although a function requires, in the worst case, a...
متن کاملBoolean hierarchies - on collapse properties and query order
To my family Acknowledgements Words can not express my deep gratitude to my advisor Professor Gerd Wechsung. Generously he ooered support, guidance, and encouragement throughout the past four years. Learning from him and working with him was and still is a pleasure and privilege I much appreciate. Through all the ups and downs of my research his optimism and humane warmth have made the downs le...
متن کاملOn PAC Learning Algorithms for Rich Boolean Function Classes
We survey the fastest known algorithms for learning various expressive classes of Boolean functions in the Probably Approximately Correct (PAC) learning model.
متن کاملA Canonical Form for Testing Boolean Function Properties
In a well-known result on graph property testing, [GT03] showed that every testable graph property has a “canonical” testing algorithm in which a set of vertices is selected uniformly at random and the edges queried are the complete graph over the selected vertices. In this paper we define a similar-in-spirit canonical form for Boolean function testing algorithms, and show that under some mild ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2003
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539700379644